大多数现有的视频文本发现基准测试专注于评估单一语言和具有有限数据的场景。在这项工作中，我们引入了大规模的双语，开放世界视频文本基准数据集（BovText）。 BovText有四个功能。首先，我们提供2,000多个具有超过1,75万多帧的视频，比现有最大数据集大25倍，其中包含录像中的附带文本。其次，我们的数据集涵盖了具有多种各种场景的30多个开放类别，例如Life VLog，驾驶，电影等。第三，为不同的代表提供了丰富的文本类型注释（即标题，标题或场景文本）视频中的意义。第四，BOVTEXT提供双语文本注释，以促进多种文化的生活和沟通。此外，我们提出了一个与变压器的端到端视频文本发现框架，被称为TransVtspotter，它通过简单但高效的关注的查询密钥机制解决了视频中的多东方文本。它将来自前一个帧的对象特征应用于当前帧的跟踪查询，并引入旋转角度预测以适合多大学实例。在ICDAR2015（视频）上，Transvtspotter以44.1％的Mota，9 FPS实现最先进的性能。 DataSet和TransVtspotter的代码可以在GitHub中找到：COM = Weijiawu = BovText和GitHub：Com = Weijiawu = Transvtspotter。

在本文中，我们在短PCCC中呈现点云颜色恒定，这是利用点云的照明色度估计算法。我们利用飞行时间（TOF）传感器捕获的深度信息与RGB传感器刚性安装，并形成一个6D云，其中每个点包含坐标和RGB强度，指出为（x，y，z，r，g，b）。PCCC将注意力架构应用于色彩恒定问题，导出照明矢量点明智，然后制定关于全局照明色度的全局决定。在两个流行的RGB-D数据集上，我们使用照明信息以及新颖的基准延伸，PCCC比最先进的算法获得更低的错误。我们的方法简单且快速，仅需要16 * 16尺寸的输入和超过500 FPS的速度，包括建立点云和净推理的成本。

基于时间序列观测数据，数据同化技术广泛用于预测具有不确定性的复杂动态系统。错误协方差矩阵建模是数据同化算法中的重要元素，其可以大大影响预测精度。这些协方差通常依赖于经验假设和物理限制的估计通常是不精确的，并且计算昂贵的昂贵，特别是对于大维度的系统。在这项工作中，我们提出了一种基于长短短期存储器（LSTM）经常性神经网络（RNN）的数据驱动方法，以提高观察协方差规范的准确性和效率的动态系统中的数据同化。与观察/模拟时间序列数据学习协方差矩阵，不同的方法不需要任何关于先前错误分布的知识或假设，而不是经典的后调整方法。我们将新的方法与两个最先进的协方差调谐算法进行了比较，即DI01和D05，首先在Lorenz动态系统中，然后在2D浅水双实验框架中，使用集合同化使用不同的协方差参数化。这种新方法在观察协方差规范，同化精度和计算效率方面具有显着的优势。

在本文中，我们提出了挖掘机活动分析和安全监测系统，利用了深度学习和计算机视觉的最新进步。我们所提出的系统在估计挖掘机的姿势和动作时检测周围环境和挖掘机。与以前的系统相比，我们的方法在对象检测，姿势估计和动作识别任务中实现了更高的准确性。此外，我们使用自动挖掘机系统（AES）构建挖掘机数据集，废物处理回收场景以展示我们系统的有效性。我们还在基准建设数据集上评估我们的方法。实验结果表明，该拟议的动作识别方法优于最先进的方法，最先进的方法约为5.18％。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

Knowledge graphs (KG) have served as the key component of various natural language processing applications. Commonsense knowledge graphs (CKG) are a special type of KG, where entities and relations are composed of free-form text. However, previous works in KG completion and CKG completion suffer from long-tail relations and newly-added relations which do not have many know triples for training. In light of this, few-shot KG completion (FKGC), which requires the strengths of graph representation learning and few-shot learning, has been proposed to challenge the problem of limited annotated data. In this paper, we comprehensively survey previous attempts on such tasks in the form of a series of methods and applications. Specifically, we first introduce FKGC challenges, commonly used KGs, and CKGs. Then we systematically categorize and summarize existing works in terms of the type of KGs and the methods. Finally, we present applications of FKGC models on prediction tasks in different areas and share our thoughts on future research directions of FKGC.

Few Shot Instance Segmentation (FSIS) requires models to detect and segment novel classes with limited several support examples. In this work, we explore a simple yet unified solution for FSIS as well as its incremental variants, and introduce a new framework named Reference Twice (RefT) to fully explore the relationship between support/query features based on a Transformer-like framework. Our key insights are two folds: Firstly, with the aid of support masks, we can generate dynamic class centers more appropriately to re-weight query features. Secondly, we find that support object queries have already encoded key factors after base training. In this way, the query features can be enhanced twice from two aspects, i.e., feature-level and instance-level. In particular, we firstly design a mask-based dynamic weighting module to enhance support features and then propose to link object queries for better calibration via cross-attention. After the above steps, the novel classes can be improved significantly over our strong baseline. Additionally, our new framework can be easily extended to incremental FSIS with minor modification. When benchmarking results on the COCO dataset for FSIS, gFSIS, and iFSIS settings, our method achieves a competitive performance compared to existing approaches across different shots, e.g., we boost nAP by noticeable +8.2/+9.4 over the current state-of-the-art FSIS method for 10/30-shot. We further demonstrate the superiority of our approach on Few Shot Object Detection. Code and model will be available.

Graph Neural Networks (GNNs) have shown satisfying performance on various graph learning tasks. To achieve better fitting capability, most GNNs are with a large number of parameters, which makes these GNNs computationally expensive. Therefore, it is difficult to deploy them onto edge devices with scarce computational resources, e.g., mobile phones and wearable smart devices. Knowledge Distillation (KD) is a common solution to compress GNNs, where a light-weighted model (i.e., the student model) is encouraged to mimic the behavior of a computationally expensive GNN (i.e., the teacher GNN model). Nevertheless, most existing GNN-based KD methods lack fairness consideration. As a consequence, the student model usually inherits and even exaggerates the bias from the teacher GNN. To handle such a problem, we take initial steps towards fair knowledge distillation for GNNs. Specifically, we first formulate a novel problem of fair knowledge distillation for GNN-based teacher-student frameworks. Then we propose a principled framework named RELIANT to mitigate the bias exhibited by the student model. Notably, the design of RELIANT is decoupled from any specific teacher and student model structures, and thus can be easily adapted to various GNN-based KD frameworks. We perform extensive experiments on multiple real-world datasets, which corroborates that RELIANT achieves less biased GNN knowledge distillation while maintaining high prediction utility.

This paper focuses on designing efficient models with low parameters and FLOPs for dense predictions. Even though CNN-based lightweight methods have achieved stunning results after years of research, trading-off model accuracy and constrained resources still need further improvements. This work rethinks the essential unity of efficient Inverted Residual Block in MobileNetv2 and effective Transformer in ViT, inductively abstracting a general concept of Meta-Mobile Block, and we argue that the specific instantiation is very important to model performance though sharing the same framework. Motivated by this phenomenon, we deduce a simple yet efficient modern \textbf{I}nverted \textbf{R}esidual \textbf{M}obile \textbf{B}lock (iRMB) for mobile applications, which absorbs CNN-like efficiency to model short-distance dependency and Transformer-like dynamic modeling capability to learn long-distance interactions. Furthermore, we design a ResNet-like 4-phase \textbf{E}fficient \textbf{MO}del (EMO) based only on a series of iRMBs for dense applications. Massive experiments on ImageNet-1K, COCO2017, and ADE20K benchmarks demonstrate the superiority of our EMO over state-of-the-art methods, \eg, our EMO-1M/2M/5M achieve 71.5, 75.1, and 78.4 Top-1 that surpass \textbf{SoTA} CNN-/Transformer-based models, while trading-off the model accuracy and efficiency well.

The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.